ar X iv : m at h / 05 07 56 5 v 1 [ m at h . C O ] 2 7 Ju l 2 00 5 REVERSE LEXICOGRAPHIC AND LEXICOGRAPHIC SHIFTING
نویسندگان
چکیده
A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆ lex — an operation that transforms a monomial ideal of S = k[x i : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a squarefree strongly stable ideal I ⊂ S is fixed by lexicographic shifting if and only if I is a universal squarefree lexsegment ideal (abbreviated USLI) of S. Moreover, in the case when I is finitely generated and is not a USLI, it is verified that all the ideals in the sequence {∆ i lex (I)} ∞ i=0 are distinct. The limit ideal ∆(I) = lim i→∞ ∆ i lex (I) is well defined and is a USLI that depends only on a certain analog of the Hilbert function of I.
منابع مشابه
ar X iv : 0 70 7 . 06 78 v 1 [ m at h . A C ] 4 J ul 2 00 7 GENERIC INITIAL IDEALS AND FIBRE PRODUCTS
We study the behavior of generic initial ideals with respect to fibre products. In our main result we determine the generic initial ideal of the fibre product with respect to the reverse lexicographic order. As an application we compute the symmetric algebraic shifted complex of two disjoint simplicial complexes as was conjectured by Kalai. This result is the symmetric analogue of a theorem of ...
متن کاملFoundations of Lexicographic Cooperative Game Theory
In the article m dimensional lexicographic noncooperative games ) ,..., ( 1 m are defined for the players’ } ,..., 2 , 1 { n N for which there exists a characteristic function T m v v v v ) ,..., , ( 2 1 . Some main features are proved of v function in a lexicographic case. A lexicographic cooperative game is called a couple v N , , where v is a real vectorfunction on N subsets ...
متن کاملDatabase Systems for Lexicographic Work
At the Institute o f Lexicography of the University of Iceland work revolves around very large collections of data in computers. There are mainly two types of databases which are kept in computer storage. The first one is a relatively simple database containing the whole vo cabulary o f the main collection o f the Institute, along with the age, number o f citation, word class, word type, and o...
متن کاملLexicographic goal programming approach for portfolio optimization
This paper will investigate the optimum portfolio for an investor, taking into account 5 criteria. The mean variance model of portfolio optimization that was introduced by Markowitz includes two objective functions; these two criteria, risk and return do not encompass all of the information about investment; information like annual dividends, S&P star ranking and return in later years which is ...
متن کاملLexicographic Product of Extendable Graphs
Lexicographic product G◦H of two graphs G and H has vertex set V (G)×V (H) and two vertices (u1, v1) and (u2, v2) are adjacent whenever u1u2 ∈ E(G), or u1 = u2 and v1v2 ∈ E(H). If every matching of G of size k can be extended to a perfect matching in G, then G is called k-extendable. In this paper, we study matching extendability in lexicographic product of graphs. The main result is that the l...
متن کامل